BRICS Basic Research in Computer Science BRICS RSMiltersen et al.: Half-Exponential Circuit Size in the Exponential Hierarchy Super-Polynomial Versus Half-Exponential

Source URL: www.brics.dk

A Counterexample to the Generalized Linial-Nisan Conjecture Scott Aaronson∗ Abstract In earlier work [1], we gave an oracle separating the relational versions of BQP and the polynomial hierarchy, and showed that an ora

Source URL: www.scottaaronson.com

• Quantum complexity theory
• Bounded-error probabilistic polynomial
• Pseudorandom generator
• Fourier transform
• IP
• FO
• Theoretical computer science
• Applied mathematics
• PP

A Casual Tour Around a Circuit Complexity Bound∗ arXiv:1111.1261v1 [cs.CC] 4 Nov 2011 Ryan Williams†

Source URL: arxiv.org

• Complexity classes
• NTIME
• Circuit complexity
• P
• Bounded-error probabilistic polynomial
• Cook–Levin theorem
• Time hierarchy theorem
• NEXPTIME
• Time complexity
• Theoretical computer science
• Computational complexity theory
• Applied mathematics

On the Complexity of Existential Positive Queries HUBIE CHEN, Universidad del Pa´ıs Vasco and IKERBASQUE We systematically investigate the complexity of model checking the existential positive fragment of firstorder lo

Source URL: tocl.acm.org

• Finite model theory
• Model theory
• Parameterized complexity
• Analysis of algorithms
• Structural complexity theory
• FO
• First-order logic
• SO
• Polynomial hierarchy
• Theoretical computer science
• Computational complexity theory
• Applied mathematics

Results of Secondary 3 Mathematics in TSA 2012 The territory-wide percentage of S.3 students achieving Mathematics Basic Competency in TSA 2012 was 79.8%. The proportion achieving basic competency in 2012 was almost the

Source URL: www.bca.hkeaa.edu.hk

• Polynomial
• Algebra
• Pi
• Fraction
• Simultaneous equations
• Dimensional analysis
• Number
• Attribute Hierarchy Method
• Algebraic geometry
• Mathematics
• Equations
• Group theory

Journal of Artificial Intelligence Research[removed]432 Submitted 07/08; published[removed]The Computational Complexity of Dominance and Consistency in CP-Nets

Source URL: www.jair.org

• Automated planning and scheduling
• STRIPS
• FO
• Constructible universe
• Net
• IP
• Polynomial hierarchy
• PSPACE
• Function
• Mathematics
• Applied mathematics
• Complexity classes

Preprint submitted to Theory of Computing Systems November 22, 2010 The Computational Complexity of Weak Saddles Felix Brandt · Markus Brill · Felix Fischer · Jan Hoffmann

Source URL: dss.in.tum.de

• Horse tack
• Saddle
• Polynomial hierarchy

covering-revision-without-comments.dvi

Source URL: dss.in.tum.de

• Complexity classes
• NP-hard
• NP-complete
• P versus NP problem
• NP
• Polynomial hierarchy
• Polynomial
• P
• Vertex cover
• Theoretical computer science
• Computational complexity theory
• Applied mathematics

Towards Ecient Universal Planning|A Randomized Approach Peter Jonsson, Patrik Haslum and Christer Backstrom Department of Computer and Information Science Linkoping University, S[removed]Linkoping, Sweden fpetej,paha

Source URL: www.ida.liu.se

• Applied mathematics
• Polynomial hierarchy
• P
• SL
• L
• NC
• Time complexity
• FO
• Completeness
• Theoretical computer science
• Computational complexity theory
• Complexity classes

October 31, 2007 CURRICULUM VITAE ALAN L. SELMAN Department of Computer Science and Engineering University at Buffalo 201 Bell Hall

Source URL: www.cse.buffalo.edu

• Computational complexity theory
• NP-complete
• ACM SIGACT
• Sparse language
• PH
• Polynomial hierarchy
• Computer science
• FL
• International Colloquium on Automata
• Languages and Programming
• Theoretical computer science
• Applied mathematics
• Complexity classes